Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction
نویسندگان
چکیده
We give the first systematic study on second order asymptotics of operational task coherence distillation with and without assistance. In unassisted setting, we introduce a variant randomness extraction framework where free incoherent operations are allowed before measurement extractors. then show that maximum number random bits extractable from given quantum state is precisely equal to coherent can be distilled same state. This relation enables us derive tight expansions both tasks in independent identically distributed setting. Remarkably, operation classes empower for generic states all admit expansions, indicating their equivalence asymptotic large block length regime. generalize above line research assisted arising naturally bipartite systems Bob distills at hand, aided by benevolent Alice possessing other system. More precisely, new establish an exact between this distillation. strengthens one-shot setting confirms cryptographic indeed offers perspective Likewise, yields characterizations tasks. As by-products, strong converse property aforementioned expansions.
منابع مشابه
Finite-block-length analysis in classical and quantum information theory
Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately o...
متن کاملOn Finite Block-Length Quantization Distortion
We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we derive a lower bound on the quantization distortion under finite block-length, which is shown to be greater than the asymptotic distortion given by the ratedis...
متن کاملRandomness Extraction in finite fields Fpn
Many technics for randomness extraction over finite fields was proposed by various authors such as Fouque et al. and Carneti et al.. At eurocrypt’09, these previous works was improved by Chevalier et al., over a finite field Fp, where p is a prime. But their papers don’t study the case where the field is not prime such as binary fields. In this paper, we present a deterministic extractor for a ...
متن کاملMulti-sources Randomness Extraction over Finite Fields and Elliptic Curve
This work is based on the proposal of a deterministic randomness extractor of a random Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite fields Fpn , G1 and G2. We show that the least significant bits of a random element in G1 ∗G2, are indistinguishable from a uniform bit-string of the same length. One of the main application of this extractor is to replac...
متن کاملOn Randomness Extraction in AC0
We consider randomness extraction by AC circuits. The main parameter, n, is the length of the source, and all other parameters are functions of it. The additional extraction parameters are the min-entropy bound k = k(n), the seed length r = r(n), the output length m = m(n), and the (output) deviation bound = (n). For k ≤ n/ log n, we show that AC-extraction is possible if and only if mr ≤ 1 + p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3064009